Fechar

1. Identificação
Tipo de ReferênciaArtigo em Evento (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Código do Detentoribi 8JMKD3MGPEW34M/46T9EHH
Identificador8JMKD3MGPEW34M/43BCFTS
Repositóriosid.inpe.br/sibgrapi/2020/09.29.21.31
Última Atualização2020:09.29.21.31.15 (UTC) administrator
Repositório de Metadadossid.inpe.br/sibgrapi/2020/09.29.21.31.15
Última Atualização dos Metadados2022:06.14.00.00.12 (UTC) administrator
DOI10.1109/SIBGRAPI51738.2020.00044
Chave de CitaçãoMagalhãesSilGomMarSil:2020:EvEmWi
TítuloEvaluating the Emergence of Winning Tickets by Structured Pruning of Convolutional Networks
FormatoOn-line
Ano2020
Data de Acesso17 maio 2024
Número de Arquivos1
Tamanho182 KiB
2. Contextualização
Autor1 Magalhães, Whendell Feijó
2 Silva, Jeferson Ferreira da
3 Gomes, Herman Martins
4 Marinho, Leandro Balby
5 Silveira, Plínio
Afiliação1 Federal University of Campina Grande
2 Federal University of Campina Grande
3 Federal University of Campina Grande
4 Federal University of Campina Grande
5 Hewlett Packard Enterprise, Brazil
EditorMusse, Soraia Raupp
Cesar Junior, Roberto Marcondes
Pelechano, Nuria
Wang, Zhangyang (Atlas)
Endereço de e-Mailwhendell@copin.ufcg.edu.br
Nome do EventoConference on Graphics, Patterns and Images, 33 (SIBGRAPI)
Localização do EventoPorto de Galinhas (virtual)
Data7-10 Nov. 2020
Editora (Publisher)IEEE Computer Society
Cidade da EditoraLos Alamitos
Título do LivroProceedings
Tipo TerciárioFull Paper
Histórico (UTC)2020-09-29 21:31:15 :: whendell@copin.ufcg.edu.br -> administrator ::
2022-06-14 00:00:12 :: administrator -> whendell@copin.ufcg.edu.br :: 2020
3. Conteúdo e estrutura
É a matriz ou uma cópia?é a matriz
Estágio do Conteúdoconcluido
Transferível1
Tipo de Versãofinaldraft
Palavras-Chaveneural network compression
structured pruning
winning tickets
weight rewinding
learning rate rewinding
ResumoThe recently introduced Lottery Ticket Hypothesis has created a new investigation front in neural network pruning. The hypothesis states that it is possible to find subnetworks with high generalization capabilities (winning tickets) from an over-parameterized neural network. One step of the algorithm implementing the hypothesis requires resetting the weights of the pruned network to their initial random values. More recent variations of this step may involve: (i) resetting the weights to the values they had at an early epoch of the unpruned network training, or (ii) keeping the final training weights and resetting only the learning rate schedule. Despite some studies have investigated the above variations, mostly with unstructured pruning, we do not know of existing evaluations focusing on structured pruning regarding local and global pruning variations. In this context, this paper presents novel empirical evidence that it is possible to obtain winning tickets when performing structured pruning of convolutional neural networks. We setup an experiment using the VGG-16 network trained on the CIFAR-10 dataset and compared networks (pruned at different compression levels) got by weight rewinding and learning rate rewinding methods, under local and global pruning regimes. We use the unpruned network as baseline and also compare the resulting pruned networks with their versions trained with randomly initialized weights. Overall, local pruning failed to find winning tickets for both rewinding methods. When using global pruning, weight rewinding produced a few winning tickets (limited to low pruning levels only) and performed nearly the same or worse compared to random initialization. Learning rate rewinding, under global pruning, produced the best results, since it has found winning tickets at most pruning levels and outperformed the baseline.
Arranjo 1urlib.net > SDLA > Fonds > SIBGRAPI 2020 > Evaluating the Emergence...
Arranjo 2urlib.net > SDLA > Fonds > Full Index > Evaluating the Emergence...
Conteúdo da Pasta docacessar
Conteúdo da Pasta sourcenão têm arquivos
Conteúdo da Pasta agreement
agreement.html 29/09/2020 18:31 1.2 KiB 
4. Condições de acesso e uso
URL dos dadoshttp://urlib.net/ibi/8JMKD3MGPEW34M/43BCFTS
URL dos dados zipadoshttp://urlib.net/zip/8JMKD3MGPEW34M/43BCFTS
Idiomaen
Arquivo Alvo133.pdf
Grupo de Usuárioswhendell@copin.ufcg.edu.br
Visibilidadeshown
Permissão de Atualizaçãonão transferida
5. Fontes relacionadas
Repositório Espelhosid.inpe.br/banon/2001/03.30.15.38.24
Unidades Imediatamente Superiores8JMKD3MGPEW34M/43G4L9S
8JMKD3MGPEW34M/4742MCS
Lista de Itens Citandosid.inpe.br/sibgrapi/2020/10.28.20.46 5
Acervo Hospedeirosid.inpe.br/banon/2001/03.30.15.38
6. Notas
Campos Vaziosarchivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination edition electronicmailaddress group isbn issn label lineage mark nextedition notes numberofvolumes orcid organization pages parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume
7. Controle da descrição
e-Mail (login)whendell@copin.ufcg.edu.br
atualizar 


Fechar